A Decentralized Architecture for Distributed Neighborhood Based Search

نویسندگان

  • Pascal Katzenbach
  • Yann Lorion
  • Tjorben Bogon
  • Ingo J. Timm
چکیده

We present a decentralized self-X architecture for distributed neighborhood based search problems using an overlay network based on random graphs. This approach provides a scalable and robust architecture with low requirements for bandwidth and computational power as well as an adequate neighborhood topology, e.g. for several instances of parallel local search and distributed learning. Together with an adapted load balancing schema our architecture is self-organizing, self-healing and self-optimizing.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modular RADAR: An Immune System Inspired Search and Response Strategy for Distributed Systems

The Natural Immune System (NIS) is a distributed system that solves challenging search and response problems while operating under constraints imposed by physical space and resource availability. Remarkably, NIS search and response times do not scale appreciably with the physical size of the animal in which its search is conducted. Many distributed systems are engineered to solve analogous prob...

متن کامل

Towards a Decentralized Search Architecture for the Web and P2P Systems

Search engines are among the most important applications or services on the web. Most existing successful search engines use a centralized architecture and global ranking algorithms to generate the ranking of documents crawled in their databases, for example, Google's PageRank. However, global ranking of documents has two potential problems: high computation cost, and potentially poor rankings....

متن کامل

Corrector-predictor arc-search interior-point algorithm for $P_*(kappa)$-LCP acting in a wide neighborhood of the central path

In this paper, we propose an arc-search corrector-predictor interior-point method for solving $P_*(kappa)$-linear complementarity problems. The proposed algorithm searches the optimizers along an ellipse that is an approximation of the central path. The algorithm generates a sequence of iterates in the wide neighborhood of central path introduced by Ai and Zhang. The algorithm does not de...

متن کامل

Application of Variable Neighborhood Search (VNS) in Configuring Membrane Systems Communications Architectures

Nowadays, it is possible to find out different viable communication architectures that implements P-Systems in a distributed cluster of processors. These proposed architectures have reached a certain compromise between the massively parallelism character of the system and the evolution step times. They are based in the distribution of several membranes in each processor, the use of proxies to c...

متن کامل

Assessment of Non-Physical Vulnerability at the Neighborhood Scale after Post-Earthquake Reconstruction Experience with a Qualitative Approach (Case study: Qodqoon neighborhood in Boroujerd)

Background and objective: The process of post-disaster reconstruction in developing societies has a high tendency for micro-scale physical renovation. This tendency, that ignore the non-physical issues, originate from the lack of large-scale planning expertise, the lack of social participation mechanisms and the political considerations that govern these countries that do not reduce vulnerabili...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009